Optimal component labeling algorithms for mesh-connected computers and VLSI

نویسنده

  • Quentin F. Stout
چکیده

Given an undirected graph G of n weighted edges, stored one edge per processor in a square mesh of n processors, we show how to determine the connected components and a minimal spanning forest in Θ( √ n) time. More generally, we show how to solve these problems in Θ(n1/d) time when the mesh is a d-dimensional cube, where the implied constants depend upon d.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Position-invariant hierarchical image analysis

Spatial hierarchy is an appealing strategy for image analysis, but standard hierarchical methods give increasingly sparse, position dependent results with increasing level. This paper endows simple hierarchical techniqueswith positioninvariance by an architectural extension, broadening their scope with no increase in algorithmic complexity. The tree structure is extended intoan exhaustive hiera...

متن کامل

A Fast Algorithm for Image Component Labeling with Local Operators on Mesh Connected Computers

A new parallel algorithm for image component labeling with local operators on SIMD mesh connected computers is presented. This algorithm provides a positive answer to the open question whether there exists an O(n)–time and O(log n)–space local labeling algorithm on SIMD mesh connected computers. The algorithm uses a pipeline mechanism with stack–like data structures to achieve the lower bound o...

متن کامل

Parallel Algorithms for Gray-Scale Digitized Picture Component Labeling on a Mesh-Connected Computer

We consider the problem of labeling connected components in a gray-scale image so that every component is connected, the maximum difference in the gray-scale values of the pixels within any component does not exceed a given value, and no component can be merged with a neighboring component. We develop two asymptotically optimal 0(n) time algorithms for generating such labelings on a mesh-connec...

متن کامل

Algorithms Minimizing Peak Power on Mesh-Connected Systems

There are many situations in parallel computing where reducing power consumption is an important goal. We consider mesh-connected systems where each processor is connected to its neighbors in a regular grid, such as occurs in cellular automata, sensor networks, and some supercomputers, focusing on systems with myriad simple processors on a chip. Most algorithms for such computers assume that al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1502.01435  شماره 

صفحات  -

تاریخ انتشار 2015